EXACT NON-IDENTITY CHECK IS NQP-COMPLETE

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact Non-identity check is NQP-complete

We define a problem “exact non-identity check”: Given a classical description of a quantum circuit with an ancilla system, determine whether it is strictly equivalent to the identity or not. We show that this problem is NQP-complete. In a sense of the strict equivalence condition, this problem is different from a QMA-complete problem, non-identity check defined in [1]. As corollaries, it is der...

متن کامل

Non-Identity Check Remains QMA-Complete for Short Circuits

The Non-Identity Check problem asks whether a given a quantum circuit is far away from the identity or not. It is well known that this problem is QMA-Complete [14]. In this note, it is shown that the Non-Identity Check problem remains QMA-Complete for circuits of short depth. Specifically, we prove that for constant depth quantum circuit in which each gate is given to at least Ω(log n) bits of ...

متن کامل

05 05 0 v 1 9 M ay 2 00 3 “ Identity check ” is QMA - complete

We define the problem “identity check”: Given a classical description of a quantum circuit, determine whether it is almost equivalent to the identity. Explicitly, the task is to decide whether the corresponding unitary is close to a complex multiple of the identity matrix with respect to the operator norm. We show that this problem is QMA-complete. A generalization of this problem is “equivalen...

متن کامل

NQP = co-C=P

Adleman, Demarrais, and Huang introduced the nondeterministic quantum polynomial-time complexity class NQP as an analogue of NP. It is known that, with restricted amplitudes, NQP is characterized in terms of the classical counting complexity class C=P. In this paper we prove that, with unrestricted amplitudes, NQP indeed coincides with the complement of C=P. As an immediate corollary, with unre...

متن کامل

Exact Meander Asymptotics: a Numerical Check

This note addresses the meander enumeration problem: “Count all topologically inequivalent configurations of a closed planar non self-intersecting curve crossing a line through a given number of points”. We review a description of meanders introduced recently in terms of the coupling to gravity of a two-flavored fully-packed loop model. The subsequent analytic predictions for various meandric c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Quantum Information

سال: 2010

ISSN: 0219-7499,1793-6918

DOI: 10.1142/s0219749910006599